1·What is a prime number?
质数是什么？
2·Which number on the card is a prime number?
在卡片上哪一个数字是最初的数字？
3·A Simple Example: a Web-Based Prime Number generator.
一个简单的示例：基于Web的质数生成器。
4·Maximum number of connections allowed. (Use a big prime number.)
允许最大的连接数。(使用较大的数。)
5·To see why, imagine a situation where the table size is not a prime number.
为了考察为什么会有这个限制，假设表的容量不是质数。
6·The realization of RSA, contains a large prime number class, very practical.
说明：RSA的实现，内含有一个大素数类，很实用。
7·Furthermore, machining method of prime number teeth gear beyond 100 is expatiated.
并阐述了大于100的质数齿齿轮的加工方法。
8·This is the largest prime number that has been discovered (with the aid of a large computer) to date.
这是迄今为止发现的最大素数(借助于一台大型计算机)。
9·And the generation of big prime number and the googol computation are also solved in this system.
在系统的实现过程中，还主要解决了大素数的生成以及大数运算等问题。
10·Together they formed the prime number Sujimoto had discovered — a number more than 42 million digits long.
它们一起组成了杉本发现的那个素数——超过4200万位长的一个数字。
1·This is the largest prime number that has been discovered (with the aid of a large computer) to date.
这是迄今为止发现的最大素数(借助于一台大型计算机)。
2·You could also write code that USES a positive integer's factors to determine if it is a prime number (defined as an integer greater than 1 whose only factors are 1 and the number itself).
您还可以编写代码，用一个正整数的因子来确定它是否为素数(定义为大于1的整数，该数字仅有的因子为1和本身)。
3·A prime number is an integer greater than or equal to 2 that has exactly two distinct natural number divisors, 1 and itself.
素数是指大于等于2且只有两个不同约数的整数：1和它自己。
4·111 can be obtained from its largest prime number factor, 37, like so: First, subtract 37 from its reverse (73) and you get 36.
111可以从它的最大素数因子37来获得，就像这样：先把37的颠倒数73减去37，就会得到36。
5·The permutation law and decision method of prime number is an important question of the number theory.
素数的排列规律和鉴别方法一直是数论中研究的重要问题之一。